全文获取类型
收费全文 | 4263篇 |
免费 | 293篇 |
国内免费 | 187篇 |
专业分类
化学 | 283篇 |
晶体学 | 2篇 |
力学 | 324篇 |
综合类 | 74篇 |
数学 | 3475篇 |
物理学 | 585篇 |
出版年
2024年 | 2篇 |
2023年 | 38篇 |
2022年 | 45篇 |
2021年 | 65篇 |
2020年 | 70篇 |
2019年 | 66篇 |
2018年 | 68篇 |
2017年 | 61篇 |
2016年 | 96篇 |
2015年 | 83篇 |
2014年 | 167篇 |
2013年 | 237篇 |
2012年 | 175篇 |
2011年 | 202篇 |
2010年 | 218篇 |
2009年 | 280篇 |
2008年 | 307篇 |
2007年 | 333篇 |
2006年 | 266篇 |
2005年 | 219篇 |
2004年 | 189篇 |
2003年 | 176篇 |
2002年 | 197篇 |
2001年 | 139篇 |
2000年 | 137篇 |
1999年 | 115篇 |
1998年 | 122篇 |
1997年 | 88篇 |
1996年 | 87篇 |
1995年 | 75篇 |
1994年 | 58篇 |
1993年 | 48篇 |
1992年 | 37篇 |
1991年 | 28篇 |
1990年 | 26篇 |
1989年 | 22篇 |
1988年 | 31篇 |
1987年 | 17篇 |
1986年 | 20篇 |
1985年 | 20篇 |
1984年 | 27篇 |
1983年 | 7篇 |
1982年 | 18篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 2篇 |
排序方式: 共有4743条查询结果,搜索用时 15 毫秒
1.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
2.
In this paper, by using qualitative analysis, we investigate the number of limit cycles of perturbed cubic Hamiltonian system with perturbation in the form of (2n+2m) or (2n+2m+1)th degree polynomials . We show that the perturbed systems has at most (n+m) limit cycles, and has at most n limit cycles if m=1. If m=1, n=1 and m=1, n=2, the general conditions for the number of existing limit cycles and the stability of the limit cycles will be established, respectively. Such conditions depend on the coefficients of the perturbed terms. In order to illustrate our results, two numerical examples on the location and stability of the limit cycles are given. 相似文献
3.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
4.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
5.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
6.
7.
曾六川 《数学物理学报(A辑)》2002,22(1):99-106
该文研究Banach空间中一类强增生型变分包含解的存在性及其具误差的Ishikawa迭代程序的收敛性问题.该文结果是几位作者早期与最近的相应结果的改进和推广. 相似文献
8.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
9.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
10.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献